instabl result high dimension nearest neighbor search dnetwork outlier detect wireless sensor network address problem unsupervis outlier detect wireless sensor network develop algorithm flexibl respect outlier definit work network commun load proport outcom reveal outcom sensor examin algorithm perform simul real sensor data stream result demonstr algorithm accur impos reason commun load level power consumpt privaci euclidean distanc preserv data perturb approxim distribut dmean cluster peer dto dpeer network instabl result high ddimension nearest neighbor search distribut decis dtree induct peer dto dpeer system paper offer scalabl robust distribut algorithm decis tree induct larg peer peer environ comput decis tree larg distribut system standard central algorithm commun expens impract synchron requir problem challeng distribut stream monitor scenario decis tree updat respons data distribut paper present altern solut work complet asynchron manner distribut environ offer low commun overhead necess scalabl seamlessli handl data peer failur paper present extens experiment result corrobor theoret claim index term peer peer data mine decis tree distribut top dk outlier detect astronomi catalog demac system dnetwork outlier detect wireless sensor network address problem unsupervis outlier detect wireless sensor network develop algorithm flexibl respect outlier definit work network commun load proport outcom reveal outcom sensor examin algorithm perform simul real sensor data stream result demonstr algorithm accur impos reason commun load level power consumpt attack view distanc preserv map privaci preserv data mine abstract examin effect distanc preserv transform privaci preserv data mine techniqu potenti import data mine algorithm effici appli transform data produc result appli origin data distanc base cluster nearest neighbor classif issu origin data hidden knowledg carefulli studi step direct assum role attack arm type prior inform origin data examin attack recov origin data transform data prior inform result offer insight vulner distanc preserv transform attack view distanc preserv map privaci preserv data mine abstract examin effect distanc preserv transform privaci preserv data mine techniqu potenti import data mine algorithm effici appli transform data produc result appli origin data distanc base cluster nearest neighbor classif issu origin data hidden knowledg carefulli studi step direct assum role attack arm type prior inform origin data examin attack recov origin data transform data prior inform result offer insight vulner distanc preserv transform dmean cluster larg dynam network distribut data mine peer dto dpeer network distribut data mine deal problem data analysi environ distribut data comput node user peer peer comput emerg distribut comput paradigm applic involv exchang inform larg number peer central coordin file share electron commerc monitor base network sensor exampl paper offer overview distribut data mine applic algorithm environ describ exact approxim distribut data mine algorithm work decentr manner cluster distribut data stream peer dto dpeer environ inform theoret histogram singl dimension select estim distribut data mine agent abstract multi agent system ma offer architectur distribut problem solv distribut data mine ddm algorithm focu class distribut problem solv task analysi model distribut data paper offer perspect ddm algorithm context multiag system discuss broadli connect ddm ma high level survei ddm focus distribut cluster algorithm potenti applic multi agent base problem solv scenario review algorithm distribut cluster includ privacypreserv describ challeng cluster sensor network environ potenti shortcom current algorithm futur work discuss confidenti privaci preserv present algorithm privaci preserv densiti base cluster multi dagent system distribut data mine present gener multi agent system framework distribut data mine base peer peer model framework adopt messag base asynchron commun dynam load balanc polici suitabl irregular search algorithm modular design separ gener purpos system protocol softwar compon specif data mine algorithm gener architectur implement successfulli test parallel frequent subgraph mine algorithm interest issu explor present work discuss introduc ongo research effort aim exploit leverag ma distribut data mine applic base ma distribut data mine decad increas avail larg amount data field scienc applic data mine techniqu popular techniqu reveal valuabl knowledg hidden rough data techniqu requir high perform approach order cope overwhelm amount data complex algorithm effect approach base distribut parallel comput approxim measur function depend investig problem defin approxim measur function depend fd fix set attribut approxim measur function map relat instanc real number number instanc map intuit describ strength depend instanc defin approxim measur fd base connect shannon inform theori relat databas theori measur normal lie inclus map relat instanc hold instanc smaller number instanc map closer fd instanc put measur context compar slight variat measur previous defin kivinen mannila denot variat result essenti appli unchang purpos compar measur develop deeper understand measur gain deeper understand natur intuit notion approxim fd observ measur agre extrem result conclud measur significantli interest question emerg conclus rigor determin measur captur mean degre fd approxim note approxim measur multi dvalu depend relat databas axiomat approach defin approxim measur function depend improv queri evalu approxim function depend base decomposit investig relat restructur improv queri perform ad path connected oper fo poli linear constraint databas commun fo poli fo linear propos foundat spatial databas queri languag strength approach languag clean natur gener codd relat model spatial set result rigor mathemat studi express complex carri line import geometr queri involv connect shown inexpress fo poli fo linear address problem extend languag parameter path connect predic pconn show fo linear pconn fo poli pconn close ptime data complex examin express fo poli pconn fo linear pconn show pariti transit closur express fastfd heurist ddriven discov function depend fd exist relat instanc import techniqu data mine databas design date effici solut exponenti number attribut relat size output exponenti lope al develop algorithm dep miner work larg randomli gener integ valu relat instanc lpl dep miner reduc fd discoveri problem find minim cover hypergraph emploi levelwis search strategi determin minim cover algorithm fastfd emploi depth heurist driven search strategi gener minim cover hypergraph type search commonli solv search problem artifici intellig ai rn experiment result levelwis strategi hallmark success data mine algorithm fact significantli surpass depth heurist driven strategi fastfd emploi due inher space effici search revisit comparison dep miner tane includ fastfd report test distinct benchmark relat instanc compar dep miner fastfd hypergraph approach tane partit approach mine fd relat instanc end paper appendix provid experiment data compar fastfd algorithm fdep fs transform answer set program fastfd heurist ddriven discov function depend fd exist relat instanc import techniqu data mine databas design date effici solut exponenti number attribut relat size output exponenti lope al develop algorithm dep miner work larg randomli gener integ valu relat instanc lpl dep miner reduc fd discoveri problem find minim cover hypergraph emploi levelwis search strategi determin minim cover algorithm fastfd emploi depth heurist driven search strategi gener minim cover hypergraph type search commonli solv search problem artifici intellig ai rn experiment result levelwis strategi hallmark success data mine algorithm fact significantli surpass depth heurist driven strategi fastfd emploi due inher space effici search revisit comparison dep miner tane includ fastfd report test distinct benchmark relat instanc compar dep miner fastfd hypergraph approach tane partit approach mine fd relat instanc end paper appendix provid experiment data compar fastfd algorithm fdep fs empir studi dvalu kripk dkleen dvalu dfound semant random proposit logic program empir studi lazi protocol rout inform dynam network critic path absolut lower bound execut time conserv parallel discret event simul stand reason optim execut time achiev immedi execut event critic path dynam identifi critic event difficult imposs paper examin heurist determin critic event conduct perform studi determin effect heurist preferenti schedul introduct ultim perform import issu parallel process gener parallel simul wide famili parallel simul algorithm conserv optimist conserv techniqu call execut event safe optimist algorithm execut event roll back 